Cyclic type factorizations of complete bipartite graphs into hypercubes
نویسنده
چکیده
So far, the smallest complete bipartite graph which was known to have a cyclic type decomposition into cubes Qd of a given dimension d was Kd2d−2,d2d−2. Using binary Hamming codes we prove in this paper that there exists a cyclic type factorization of K2d−1,2d−1 into Qd if and only if d is a power of 2.
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملInterval cyclic edge-colorings of graphs
A proper edge-coloring of a graph G with colors 1, , t is called an interval cyclic t coloring if all colors are used, and the edges incident to each vertex ( ) v V G are colored with ( ) G d v consecutive colors by modulo t , where ( ) G d v is the degree of the vertex v in G . In this paper some properties of interval cyclic edge-colorings are investigated. Also, we give some bounds for...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملA Quantitative Approach to Perfect One-Factorizations of Complete Bipartite Graphs
Given a one-factorization F of the complete bipartite graph Kn,n, let pf(F) denote the number of Hamiltonian cycles obtained by taking pairwise unions of perfect matchings in F . Let pf(n) be the maximum of pf(F) over all one-factorizations F of Kn,n. In this work we prove that pf(n) > n2/4, for all n > 2. 1 Perfect one-factorizations A one-factorization of a graph G is a partition of its set o...
متن کاملPancomponented 2-factorizations of complete graphs
We pose and solve the existence of 2-factorizations of complete graphs and complete bipartite graphs that have the number of cycles per 2-factor varying, called pancomponented. Such 2-factorizations exist for all such graphs. The pancomponented problem requires a slight generalization of the methods used to solve pancyclic 2-factorization problem, by building 2-factors from cyclically generated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 25 شماره
صفحات -
تاریخ انتشار 2002